E cient Genetic Programming for Finding Good Generalizing Boolean Functions
نویسنده
چکیده
This paper shows how genetic programming (GP) can help in nding generalizing Boolean functions when only a small part of the function values are given. The selection pressure favours functions having as few subfunctions as possible while only using essential variables, so the resulting functions should have good generalization properties. For e ciency no S-expressions are used for representation, but a special case of directed acyclic graphs known as ordered binary decision diagrams (OBDDs), making it possible to learn the 20-multiplexer.
منابع مشابه
cient Genetic Programming for Finding
This paper shows how genetic programming (GP) can help in nd-ing generalizing Boolean functions when only a small part of the function values are given. The selection pressure favours functions having as few subfunctions as possible while only using essential variables, so the resulting functions should have good generalization properties. For eeciency no S-expressions are used for representati...
متن کاملEecient Genetic Programming for Finding Good Generalizing Boolean Functions
This paper shows how genetic programming (GP) can help in nd-ing generalizing Boolean functions when only a small part of the function values are given. The selection pressure favours functions having as few subfunctions as possible while only using essential variables, so the resulting functions should have good generalization properties. For eeciency no S-expressions are used for representati...
متن کاملA Fast and Self-Repairing Genetic Programming Designer for Logic Circuits
Usually, important parameters in the design and implementation of combinational logic circuits are the number of gates, transistors, and the levels used in the design of the circuit. In this regard, various evolutionary paradigms with different competency have recently been introduced. However, while being advantageous, evolutionary paradigms also have some limitations including: a) lack of con...
متن کاملDesign and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Distributed Hybrid Genetic Programming for Learning Boolean Functions
When genetic programming (GP) is used to find programs with Boolean inputs and outputs, ordered binary decision diagrams (OBDDs) are often used successfully. In all known OBDD-based GP-systems the variable ordering, a crucial factor for the size of OBDDs, is preset to an optimal ordering of the known test function. Certainly this cannot be done in practical applications, where the function to l...
متن کاملLower Bound of the Size of OBDDs Representing Division
In various elds of computer science, it is often required to represent Boolean functions succinctly and to manipulate them e ciently. An Ordered Binary Decision Diagram (OBDD) [1, 2] is a directed acyclic graph representing a Boolean function. OBDDs have the following properties. 1) For a given variable ordering, OBDDs have a reduced canonical form for each Boolean function. 2) Many practical B...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998